Resultaten visas 1 - 10 / 2363
resultat / per sida
Vilka publikationsuppgifter finns i tjänsten?
Publikationens namn
Upphovspersoner
Publikationskanal
År
Publicationer information ikon

Order-preserving pattern matching with k mismatches

Referentgranskad
DOI
10.1016/j.tcs.2015.08.022
Gawrychowski, Paweł; Uznanski, Przemyslaw
Theoretical Computer Science2016Publicationer information ikon

Approximate string matching with reduced alphabet

Referentgranskad
Salmela, Leena; Tarhio, Jorma
SPRINGER2010Publicationer information ikon

Approximate pattern matching in LZ77-compressed texts

Referentgranskad
DOI
10.1016/j.jda.2014.10.003
Gagie, Travis; Gawrychowski, Pawel; Puglisi, Simon J.
Journal of Discrete Algorithms2015Publicationer information ikon

Fast Indexes for Gapped Pattern Matching

Referentgranskad
Öppen tillgång
DOI
10.1007/978-3-030-38919-2_40
Cáceres, Manuel; Puglisi, Simon; Zhukova, Bella
SOFSEM2020Publicationer information ikon

Indexing variable length substrings for exact and approximate matching

Referentgranskad
Navarro, Gonzalo; Salmela, Leena
SPRINGER2009Publicationer information ikon

Faster Approximate Pattern Matching in Compressed Repetitive Texts

Referentgranskad
Gagie, Travis; Gawrychowski, Pawel; Puglisi, Simon J.
SPRINGER2011Publicationer information ikon

Multi-Pattern Matching with Bidirectional Indexes

Referentgranskad
Gog, Simon; Karhu, Kalle; Kärkkäinen, Juha; Mäkinen, Veli; Välimäki, Niko
Journal of Discrete Algorithms2014Publicationer information ikon

Multi-Pattern Matching with Bidirectional Indexes

Referentgranskad
Gog, Simon; Karhu, Kalle; Kärkkäinen, Juha; Mäkinen, Veli; Välimäki, Niko
SPRINGER2012Publicationer information ikon

Approximate Boyer-Moore string matching for small alphabets

Referentgranskad
DOI
10.1007/s00453-009-9286-3
Salmela, Leena; Tarhio, Jorma; Kalsi, Petri
Algorithmica2010Publicationer information ikon

Bit-parallel approximate matching of circular strings with k mismatches

Referentgranskad
DOI
10.1145/3129536
Hirvola, Tommi; Tarhio, Jorma
ACM Journal of Experimental Algorithmics2017

Order-preserving pattern matching with k mismatches

Referentgranskad
DOI
10.1016/j.tcs.2015.08.022
2016

Approximate string matching with reduced alphabet

Referentgranskad
2010

Approximate pattern matching in LZ77-compressed texts

Referentgranskad
DOI
10.1016/j.jda.2014.10.003
2015

Fast Indexes for Gapped Pattern Matching

Referentgranskad
Öppen tillgång
DOI
10.1007/978-3-030-38919-2_40
2020

Indexing variable length substrings for exact and approximate matching

Referentgranskad
2009

Faster Approximate Pattern Matching in Compressed Repetitive Texts

Referentgranskad
2011

Multi-Pattern Matching with Bidirectional Indexes

Referentgranskad
2014

Multi-Pattern Matching with Bidirectional Indexes

Referentgranskad
2012

Approximate Boyer-Moore string matching for small alphabets

Referentgranskad
DOI
10.1007/s00453-009-9286-3
2010

Bit-parallel approximate matching of circular strings with k mismatches

Referentgranskad
DOI
10.1145/3129536
2017